Treewidth and Minimum Fill-in on d-Trapezoid Graphs
نویسندگان
چکیده
منابع مشابه
Treewidth and Minimum Fill-in on d-Trapezoid Graphs
We show that the minimum fill-in and the minimum interval graph completion of a d-trapezoid graph can be computed in time O(n). We also show that the treewidth and the pathwidth of a d-trapezoid graph can be computed by an O(n tw(G) ) time algorithm. For both algorithms, d is supposed to be a fixed positive integer and it is required that a suitable intersection model of the given d-trapezoid g...
متن کاملTreewidth and Minimum Fill-in of Weakly Triangulated Graphs
We introduce the notion of potential maximal cliquee of a graph and we use it for computing the treewidth and the minimum ll-in of graphs for which the the potential maximal cliques can be listed in polynomial time. Finally we show how to compute the potential maximal cliques of weakly triangulated graphs. triangulations RRsumm Nous introduisons la notion de clique potentielle maximalee d'un gr...
متن کاملMinimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs
We show that a minimum ll-in ordering of a graph can be determined in linear time if it can be modularly decomposed into chordal graphs. This generalizes results of 2]. We show that the treewidth of these graphs can be determined in O((n + m) log n) time.
متن کاملOn Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs
We present O(n’R + n3R3) time algorithms to compute the treewidth, pathwidth, minimum fill-in and minimum interval graph completion of asteroidal triple-free graphs, where n is the number of vertices and R is the number of minimal separators of the input graph. This yields polynomial time algorithms for the four NP-complete graph problems on any subclass of the asteroidal triple-free graphs tha...
متن کاملMinimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
In this paper we investigate how graph problems that are NP-hard in general, but polynomially solvable on split graphs, behave on input graphs that are close to being split. For this purpose we define split+ke and split+kv graphs to be the graphs that can be made split by removing at most k edges and at most k vertices, respectively. We show that problems like treewidth and minimum fill-in are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 1998
ISSN: 1526-1719
DOI: 10.7155/jgaa.00008